Combination of decoding of error-correcting codes and equalization for channels with intersymbol interference

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equalization of Sparse Intersymbol-Interference Channels Revisited

Sparse intersymbol-interference (ISI) channels are encountered in a variety of communication systems, especially in high-datarate systems. These channels have a large memory length, but only a small number of significant channel coefficients. In this paper, equalization of sparse ISI channels is revisited with focus on trellis-based techniques. Due to the large channel memory length, the comple...

متن کامل

Joint Equalization and Soft Decoding for Vector Quantization over Channels with Intersymbol Interference

An approach to joint equalization and decoding for vector quantization over a Gaussian channel with intersymbol interference is presented. The decoder is based on a Hadamard transform representation of the vector quantizer. This gives the decoder a structure that allows the decoding to be based on estimates of the transmitted bits in an efficient manner. The decoder is soft in the sense that so...

متن کامل

Joint Equalization and Decoding for Nonlinear Two-Dimensional Intersymbol Interference Channels with Application to Optical Storage

An algorithm that performs joint equalization and decoding for nonlinear two-dimensional intersymbol interference channels is presented. The algorithm performs sum-product message-passing on a factor graph that represents the underlying system. The two-dimensional optical storage (TWODOS) technology is an example of a system with nonlinear two-dimensional intersymbol interference. Simulations f...

متن کامل

Decoding error-correcting codes with Gröbner bases

The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equations by means of Buchberger’s algorithm for finding a Gröbner basis. This generalizes the algorithm of Berlekamp-Massey for decoding ReedSolomon, Goppa and cyclic codes up to half the true minimum distance by introducing the unknown syndromes as variables. The complexity of this algorithm is expon...

متن کامل

Lattice-Reduction-Aided Equalization for Transmission over Intersymbol-Interference Channels

In this paper we consider transmission over channels which produce intersymbol interference. New equalization schemes derived from recently proposed lattice-reduction-aided equalization of multiple-input/ multiple-output channels are presented. The schemes exhibit low complexity, require no or only very little channel state information at the transmitter, and channel coding can be immediately a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1991

ISSN: 0166-218X

DOI: 10.1016/0166-218x(91)90112-a